Papers with lexical LCFRS
Supertagging-based Parsing with Linear Context-free Rewriting Systems (2021.naacl-main)
Copied to clipboard
| Challenge: | a new supertagging-based parser for linear context-free rewriting systems is developed for discontinuous constituents . discontinuous constituencies span non-contiguous sets of positions in a sentence, and can be modelled by CFG . |
| Approach: | They propose a supertagging-based parser for linear context-free rewriting systems . they propose an efficient procedure which induces a lexical LCFRS from any discontinuous treebank . |
| Outcome: | The proposed method outperforms previous LCFRS-based parsers in accuracy and speed by a wide margin. |